Edge fault - diameter of graph product ∗
نویسنده
چکیده
The product graph B ∗ F of graphs B and F is an interesting model in the design of large reliable networks. Let G be a kG-edge connected graph and DE c (G) be the largest diameter of subgraphs of G obtained by deleting c < kG edges. We prove that DE a+b+1(B ? F ) ≤ DE a (F ) +DE b (B) + 1 where a < kF , and b < kB . Key–Words: product graph, edge-connectivity, edge fault-diameter, reliable interconnection network.
منابع مشابه
Fault diameters of graph products and bundles
Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G is defined as the minimum integer d for which there exist at least k i...
متن کاملMixed Connectivity of Cartesian Graph Products and Bundles
An interconnection network should be fault tolerant, because practical communication networks are exposed to failures of network components. Both failures of nodes and failures of connections between them happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. A lot of work has been done on various aspects of netwo...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملImproved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
Mixed fault diameter of a graph G, D(a,b)(G), is the maximal diameter of G after deletion of any a vertices and any b edges. Special cases are the (vertex) fault diameter D a = D(a,0) and the edge fault diameter D E a = D(0,a). Let G be a Cartesian graph bundle with fibre F over the base graph B. We show that (1) D a+b+1(G) ≤ D V a (F )+D V b (B) when the graphs F and B are kF -connected and kB...
متن کاملFaithful 1-Edge Fault Tolerant Graphs
A graph G* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G’ contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can be easily verified that the Cartesian product graph G; x G; is l-edge fault tolerant with respect ...
متن کامل